Performance analysis of breadth-first search and depth-first search on MANET for health monitoring system
نویسندگان
چکیده
Abstract The development of mobile ad-hoc network (MANET) technology is increasing and directly proportional to the need. MANET a wireless consisting several nodes moving freely without using infrastructure. can be applied in various fields such as military, natural disasters, health services. sector, especially monitoring system, gets more attention because it involves maintaining patient safety. However, devices installed services have not been able reach patients. This condition causes required time energy consumption increase. Therefore, breadth-first search (BFS) depth-first (DFS) methods are indispensable determining quality service (QoS) MANET. QoS parameters analyzed include packet delivery ratio (PDR), throughput, loss, delay, consumption. study aims choose data traffic route that improve when transmitting data. simulation results 2018 version MATLAB show BFS has better performance than DFS on delay parameters. Meanwhile, PDR, loss
منابع مشابه
Depth/Breadth first search with applications
Given a graph G = (V,E) and a vertex u ∈ V , we would like to explore every vertex (and every edge) reachable from u. Let n = |V | and m = |E|. The graph may be directed or undirected. We will assume that the graph is given in its adjacency list representation (rather than adjacency matrix), i.e. for each vertex u, we have a linked list adj[u] of the neighbors of u (all vertices v such that (u,...
متن کاملCombining depth-first and breadth-first search in Prolog execution
A new model for the execution of Prolog programs, called MEM (Multipath Execution Model), which combines a depth-first and breadth-first exploration of the search tree is presented. The breadth-first search allows more than one path (multiple potential solutions) to be explored at the same time. In this way, the computational cost of traversing the whole search tree associated to a program can ...
متن کاملA appraisal paper on Breadth-first search, Depth-first search and Red black tree
Breadth-first and depth-first search are indispensable adventure strategies leading which many other rummage around algorithms are built. In this dissertation, we projected an loomed of integrating these two strategies in a solitary algorithm that combines the corresponding strengths of mutual. We account preliminary computational outcome using the tree width predicament as an example. This dis...
متن کاملSemantic Social Breadth-first search and Depth- first search Recommendation Algorithms SSBFS and SSDFS recommendation
Social networks gained more attention over the last years, due to their importance in the users’ modern life. Moreover, social networks have become a great source of information, and several applications have been proposed to extract information from them such as: recommender systems. In this paper we present two recommendation algorithms called: Semantic Social Breadth First Search SSBFS and S...
متن کاملBreadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP conference series
سال: 2022
ISSN: ['1757-899X', '1757-8981']
DOI: https://doi.org/10.1088/1755-1315/1075/1/012011